Loading supply vessels by forward checking and a guillotine that doesn't cut
نویسنده
چکیده
The problem of planning the layout of containers on board supply vessels can be reformulated as the problem of packing a given set of rectangles into a larger rectangle, subject to constraints. A method combining the use of guillotine cuts with forward checking is proposed, and compared to standard forward checking on finite domains. The initial results show that the method has potential for improving the efficiency of algorithms for tackling such problems. Loading supply vessels by forward checking and a guillotine that doesn't cut
منابع مشابه
Cut equivalence of d-dimensional guillotine partitions
A guillotine partition of a d-dimensional axis-aligned box B is a recursive partition of B by axis-aligned hyperplane cuts. The size of a guillotine partition is the number of boxes it contains. Two guillotine partitions are box-equivalent if their boxes satisfy compatible order relations with respect to the axes. (In many works, box-equivalent guillotine partitions are considered identical.) I...
متن کاملA Tale on Guillotine Cut
The guillotine cut is an important tool to design polynomialtime approximation schemes for geometric optimization problems. In this article, we survey its history and recent developments.
متن کاملEffects of Chemicals on Vase Life of Cut Carnation( Dianthus caryophyllus L. 'Delphi ') and Microorganisms Population in Solution
The vase life of cut flowers and foliage is often shortened by vascular occlusions that constrict vase solution supply. Reduction in stem conductivity is typically caused by blockage of cut stem ends and xylem conduits by microbes, physiological plugging, and disruption of water columns in xylem vessels by cavitations and air emboli. Cut flower and foliage longevity can be greatly affected by t...
متن کاملIterated Local Search Algorithm for the Constrained Two-Dimensional Non-Guillotine Cutting Problem
An Iterated Local Search method for the constrained two-dimensional non-guillotine cutting problem is presented. This problem consists in cutting pieces from a large stock rectangle to maximize the total value of pieces cut. In this problem, we take into account restrictions on the number of pieces of each size required to be cut. It can be classified as 2D-SLOPP (two dimensional single large o...
متن کاملOn Guillotine Cutting Sequences
Imagine a wooden plate with a set of non-overlapping geometric objects painted on it. How many of them can a carpenter cut out using a panel saw making guillotine cuts, i.e., only moving forward through the material along a straight line until it is split into two pieces? Already fifteen years ago, Pach and Tardos investigated whether one can always cut out a constant fraction if all objects ar...
متن کامل